Fast Evaluation of Protocol Processor Architectures for IPv6

نویسندگان

  • Johan Lilius
  • Dragos Truscan
  • Seppo Virtanen
چکیده

In this paper we present a design case study in configuring our protocol processor architecture to meet the performance requirements of IPv6 routing at gigabit speeds. Our methodology makes it possible to make fast reliable analyses of the problem on a high level and to find its key bottlenecks and design constraints. Based on the analyses we suggest architectural configurations for the target application. The best configurations can then be further analyzed in more detailed system-level simulations and physical esti-

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Enhanced fast handoff scheme for heterogeneous wireless networks

Mobility management, integration and interworking of existing wireless systems are important factors to obtain seamless roaming and services continuity in next generation or 4G wireless networks (NGWN/4G). Although, several IPv6-based mobility protocols as well as interworking architectures have been proposed in the literature, they cannot guarantee seamless roaming, especially for real-time ap...

متن کامل

A High Performance Parallel IP Lookup Technique Using Distributed Memory Organization and ISCB-Tree Data Structure

The IP Lookup Process is a key bottleneck in routing due to the increase in routing table size, increasing traıc and migration to IPv6 addresses. The IP address lookup involves computation of the Longest Prefix Matching (LPM), which existing solutions such as BSD Radix Tries, scale poorly when traıc in the router increases or when employed for IPv6 address lookups. In this paper, we describe a ...

متن کامل

A High Performance Parallel IP Lookup Technique Using Distributed Memory Organization and ISCB-Tree Data Structure

The IP Lookup Process is a key bottleneck in routing due to the increase in routing table size, increasing traıc and migration to IPv6 addresses. The IP address lookup involves computation of the Longest Prefix Matching (LPM), which existing solutions such as BSD Radix Tries, scale poorly when traıc in the router increases or when employed for IPv6 address lookups. In this paper, we describe a ...

متن کامل

Design of fast lookup Content Addressable Memory (CAM) of a Next Generation IPv6 Network Processor

Ideally, the major problem of header lookup in a Next Generation IPv6 Network Processor could be solved by using an appropriately large Content Addressable Memory (CAM) structure containing preprocessed routing and firewall rules. Currently, there are no sufficiently wide CAMs available in the market. As only around 272 bits out of 596 needed can be matched in CAM for IPv6 packet processing, se...

متن کامل

TrieC: A High-Speed IPv6 Lookup with Fast Updates Using Network Processor

Address lookup is one of the main bottlenecks in Internet backbone routers, as it requires the router to perform a longest-prefix-match when searching the routing table for a next hop. Ever-increasing Internet bandwidth, continuously growing prefix table size and inevitable migration to IPv6 address architecture further exacerbate this situation. In recent years, a variety of highspeed address ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2002